Relative expressiveness of defeasible logics II
نویسنده
چکیده
(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. The second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. Thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. This completes the study of relative expressiveness in DL begun in (Maher 2012).
منابع مشابه
Relative Expressiveness of Well-Founded Defeasible Logics
An approach to formulating relative expressiveness of defeasible logics was introduced in [14]. In this paper we address the relative expressiveness of the well-founded defeasible logics in the framework WFDL and their relationship to the defeasible logics in the framework DL. We show that, in terms of defeasible reasoning, the logics in WFDL have greater (or equal) expressiveness than those in...
متن کاملRelative expressiveness of defeasible logics
We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulation...
متن کاملComparing Defeasible Logics
In this paper we seek to formally establish the similarities and differences between two formalizations of defeasible reasoning: the defeasible logics of Nute and Maier, and defeasible logics in the framework of Antoniou et al. Both families of logics have developed from earlier logics of Nute, but their development has followed different paths and they are formulated very differently. We exami...
متن کاملA Defeasible Logic for Clauses
A new non-monotonic logic called clausal defeasible logic (CDL) is defined and explained. CDL is the latest in the family of defeasible logics, which, it is argued, is important for knowledge representation and reasoning. CDL increases the expressive power of defeasible logic by allowing clauses where previous defeasible logics only allowed literals. This greater expressiveness allows the repre...
متن کاملRelative Expressiveness of Defeasible Logics II published in Theory and Practice of Logic Programming
For every inference rule +d there is a closely related inference rule −d allowing to infer that some literals q cannot be consequences of D via +d. The relationship between +d and −d is described as the Principle of Strong Negation (Antoniou et al. 2000). These inference rules are placed adjacently to emphasize this relationship. Some notation in the inference rules requires explanation. Given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 13 شماره
صفحات -
تاریخ انتشار 2013